Ensemble? and distance?based feature ranking for unsupervised learning
نویسندگان
چکیده
In this work, we propose two novel (groups of) methods for unsupervised feature ranking and selection. The first group includes scores (Genie3 score, RandomForest score) that are computed from ensembles of predictive clustering trees. second method is URelief, the extension Relief family algorithms. Using 26 benchmark data sets 5 baselines, show both Genie3 score (computed ensemble extra trees) URelief outperform existing performs best overall, in terms power top-ranked features. Additionally, analyze influence hyper-parameters proposed on their performance, highest quality achieved by most efficient parameter configuration. Finally, a way discovering location features ranking, which relevant reality.
منابع مشابه
Adaptive Feature Ranking for Unsupervised Transfer Learning
Transfer Learning is concerned with the application of knowledge gained from solving a problem to a different but related problem domain. In this paper, we propose a method and efficient algorithm for ranking and selecting representations from a Restricted Boltzmann Machine trained on a source domain to be transferred onto a target domain. Experiments carried out using the MNIST, ICDAR and TiCC...
متن کاملEnsemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Selection is known as Feature Ranking, ranking the features with respect to their relevance. This paper proposes an ensemble approach for Feature Ranking, aggregating feature rankings extracted along independent runs of a...
متن کاملEnsemble Learning with Evolutionary Computation: Application to Feature Ranking
Exploiting the diversity of hypotheses produced by evolutionary learning, a new ensemble approach for Feature Selection is presented, aggregating the feature rankings extracted from the hypotheses. A statistical model is devised to enable the direct evaluation of the approach; comparative experimental results show its good behavior on non-linear concepts when the features outnumber the examples.
متن کاملiRANK: A rank-learn-combine framework for unsupervised ensemble ranking
The authors address the problem of unsupervised ensemble ranking. Traditional approaches either combinemultiple ranking criteria into a unified representation to obtain an overall ranking score or to utilize certain rank fusion or aggregation techniques to combine the ranking results. Beyond the aforementioned “combine-thenrank” and “rank-then-combine” approaches, the authors propose a novel “r...
متن کاملFeature Selection for Unsupervised Learning
In this paper, we identify two issues involved in developing an automated feature subset selection algorithm for unlabeled data: the need for finding the number of clusters in conjunction with feature selection, and the need for normalizing the bias of feature selection criteria with respect to dimension. We explore the feature selection problem and these issues through FSSEM (Feature Subset Se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems
سال: 2021
ISSN: ['1098-111X', '0884-8173']
DOI: https://doi.org/10.1002/int.22390